Gray-Scale Structuring Element Decomposition - Image Processing, IEEE Transactions on
نویسنده
چکیده
AbstructEfficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. In this paper, we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomposition of any arbitrary gray-scale structuring element.
منابع مشابه
Gray-scale structuring element decomposition
Efficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick (1986) presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. We use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomp...
متن کاملMultiscale morphological segmentation of gray-scale images
In this paper, the authors have proposed a method of segmenting gray level images using multiscale morphology. The approach resembles the watershed algorithm in the sense that the dark (respectively bright) features which are basically canyons (respectively mountains) on the surface topography of the gray level image are gradually filled (respectively clipped) using multiscale morphological clo...
متن کاملDecomposition of Gray-Scale Morphological Templates Using the Rank Method
Convolutions are a fundamental tool in image processing. Classical examples of two dimensional linear convolutions include image correlation, the mean filter, the discrete Fourier transform, and a multitude of edge mask filters. Nonlinear convolutions are used in such operations as the median filter, the medial axis transform, and erosion and dilation as defined in mathematical morphology. For ...
متن کاملDecomposition of Grey-Scale Morphological Structuring Elements in Hardware
AbstractMorphological image processing machines are not capable of handling large-size structuring elements. A new architecture for fast execution of the erosion/dilation operations in an up to 9× 9-pixel, arbitrarily shaped, image window through decomposition of grey-scale morphological structuring element into 3× 3-pixel sub-domains is presented in this paper. The proposed hardware structure ...
متن کاملA fast implementation of 3-D binary morphological transformations
This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional (3-D) images, using 3-D structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition. The eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996